Projective Transformations in Function Space
نویسندگان
چکیده
منابع مشابه
Efficiently Estimating Projective Transformations
18 1.0855 -0.0013 1.0730 -0.0089 0.8700 0.0140 0.0650 -0.2100 1.0280 0.0337 0.1110 -0.2300 0.0444 0.7410 0.3860 0.6583 -0.2050 1.1030 1.0010 0.1500 -4.1640 2.2550 0.9800 0.1250 64.063 -34.000 -32.330 -30.630 78.510 4.7000 -65.218 95.230 426.76 27.377 -89.220 111.10 0.000169 -0.000163 0.000690 -0.001120 -0.000580 0.002020 -0.001570 -0.001300 -0.000096 0.008170 -0.001586 -0.000862 Ex. # wj a11 a21 ^
متن کاملComputation in Projective Space
This paper presents solutions of some selected problems that can be easily solved by the projective space representation. If the principle of duality is used, quite surprising solutions can be found and new useful theorems can be generated as well. There are many algorithms based on computation of intersection of lines, planes, barycentric coordinates etc. Those algorithms are based on represen...
متن کاملPseudo Ricci symmetric real hypersurfaces of a complex projective space
Pseudo Ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo Ricci symmetric real hypersurfaces of the complex projective space CPn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.
متن کاملAdaptive Hybrid Function Projective Synchronization of Chaotic Space-Tether System
In this paper, we have achieved adaptive hybrid function projective synchronization between two identical chaotic space-tether systems with uncertain time-varying parameters and with each system evolving from different initial conditions by applying adaptive control technique. Based on Lyapunov stability theory, adaptive control laws and parameter update laws for estimating the uncertain, timev...
متن کاملColouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the k-dimensional subspaces of V as its vertices, where two subspaces α and β are adjacent if and only if α ∩ β is the zero subspace. This paper is motivated by the problem of determining the chromatic numbers of these graphs. This problem is trivial when k = 1 (and the graphs are complete) or when v < 2k (an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1919
ISSN: 0002-9947
DOI: 10.2307/1988983